Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems

• The BAP and the Quay Cranes Assignment Problem is studied. A mixed integer linear programming model developed. An efficient construction heuristics are proposed. metaheuristic approach designed. Experimental results demonstrate effectiveness of proposal. Berth Allocation two decisive seaside operations planning problems in maritime terminals. Therefore, integrating these critical improving any terminal's performance enhancing its attractivity. This paper deals with integrated problem for a continuous quay's topology dynamic vessels' arrivals. In addition to berth plan respecting quay cranes' capacity constraints, specific time-invariant assignments must also be determined. novel mixed-integer formulation (MILP) Variable Neighborhood Search (VNS) presented. developed approaches tested on randomly generated instances. particular, MILP compared existing exact methods. numerical experiments showed that provides state-of-the-art results. Furthermore, VNS presents consistent alternative MILP, especially large-scale